/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: Hua YY
 * Date: 2025-01-30
 * Time: 10:15
 */
/*
*
 * Definition for singly-linked list.
 * public class ListNode {
 * int val;
 * ListNode next;
 * ListNode() {}
 * ListNode(int val) { this.val = val; }
 * ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
*/
class Solution2 {
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        // 递归出口
        if(list1 == null) return list2;
        if(list2 == null) return list1;
        // 1:选取，头结点中值较小的那个
        if (list1.val <= list2.val) {
            list1.next = mergeTwoLists(list1.next,list2);
            return list1;
        }else{
            list2.next = mergeTwoLists(list2.next,list1);
            return list2;
        }
    }
}
public class Test2 {
}
